Contiguity Constraints for Single-Region Site Search Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality for vector equilibrium problems with constraints

‎In the paper‎, ‎we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior‎. ‎Then‎, ‎their applications to optimality conditions for quasi-relative efficient solutions are obtained‎. ‎Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...

متن کامل

CHAOS EMBEDDED CHARGED SYSTEM SEARCH FOR PRACTICAL OPTIMIZATION PROBLEMS

Chaos is embedded to the he Charged System Search (CSS) to solve practical optimization problems. To improve the ability of global search, different chaotic maps are introduced and three chaotic-CSS methods are developed. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for practical civil optimization problems.

متن کامل

Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity

A number of optimisation problems involve the optimal grouping of a finite set of items into a number of categories subject to one or more constraints. Such problems raise interesting issues in mapping solutions in genetic algorithms. These problems range from the knapsack problem to bin packing and cutting stock problems. This paper describes research involving cutting stock problems. Results ...

متن کامل

Terminal Constraints for Single-stage Multi-product Scheduling Problems

In scheduling, it is important to maintain the terminal inventory levels above threshold values to prevent stockout. However, simply enforcing the terminal inventory level above a lead-time-based threshold for each product, as it is common practice, does not exploit the relationships of inventory levels among products. To overcome this drawback, we propose a new type of terminal constraints for...

متن کامل

Network Data as Contiguity Constraints in Modeling Preference Data

In the last decades the use of regression-like preference models has found widespread application in marketing research. The Conjoint Analysis models have even more been used to analyze consumer preferences and simulate product positioning. The typical data structure of this kind of models can be enriched by the presence of supplementary information observed on respondents. We suppose that rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geographical Analysis

سال: 2010

ISSN: 0016-7363

DOI: 10.1111/j.1538-4632.2000.tb00430.x